منابع مشابه
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This problem has been examined under diierent constraints on the tree and on the set of paths, from which the core can be chosen. For all cases, we present linear or almost linear time algorithms, which improves the previous resu...
متن کاملIdentifier length and limited programmer memory
Because early variable mnemonics were limited to as few as six to eight characters, many early programmers abbreviated concepts in their variable names. The past thirty years have seen a steady increase in permitted name length and, slowly, an increase in the actual identifier length. However, in theory names can be too long for programmers to comprehend and manipulate effectively. Most obvious...
متن کاملPractical Length-limited Coding for Large Alphabets
The use of Huuman coding for economical representation of a stream of symbols drawn from a deened source alphabet is widely known. In this paper we consider the problems encountered when Huuman coding is applied to an alphabet containing millions of symbols. Conventional tree-based methods for generating the set of codewords require large amounts of main memory; and worse, the codewords generat...
متن کاملCodes of Length 2 Correcting Single Errors of Limited Size
Linear codes over Zq of length 2, correcting single errors of size at most k, are considered. It is determined for which q such codes exists and explicit code constructions are given for those q. One case remains open, namely q = (k + 1)(k + 2), where k + 1 is a prime power. For this case we conjecture that no such codes exist.
متن کاملParallel Construction of the Minimum Redundancy Length-limited Codes
This paper presents new results on the construction of the length-limited preex-free codes with the minimum redundancy. We describe an algorithm for the construction of length-limited codes that works in O(L) time with n processors, where L is the maximal codeword length. We also describe an algorithm for the construction of almost optimal length-limited codes that works in O(log n) time with n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Physics
سال: 2019
ISSN: 1745-2473,1745-2481
DOI: 10.1038/s41567-019-0674-6